Buffer Management Algorithms in Unbounded Buffers

Buffer Management Algorithms in Unbounded Buffers

Designing an Unbounded Buffer in Rely-Guarantee

We use a variety of consumer-producer specifications to illustrate the range of choices and rationale that arise in concurrent specifications using rely-guarantee. We also extend postconditions with a new argument to make explicit the environment assigned to the process, and present a semantics for possible values that explores the new parameter in postconditions. All specifications presented i...

Buffer Management in Cellular IP Networks using Evolutionary Algorithms

Real-time traffic in Cellular IP network is considered to be important and therefore given priority over nonreal-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for...

Compatibility Control of Asynchronous Communicating Systems with Unbounded Buffers

The composition of heterogeneous software components is required in many domains to build complex systems. However, such compositions raise mismatches between components such as unspecified messages. Checking compatibility for asynchronously communicating systems with unbounded channels is undecidable. In this paper, we propose a compatibility control approach based on a coverability product, w...

Randomized Algorithms for Buffer Management with 2-Bounded Delay

In the buffer management problem with bounded delay, weighted packets arrive at a network switch over time, and the goal is to send those packets before their deadlines while maximizing the total weight of the packets sent. In the 2-bounded delay case, each packet has to be sent either in the step of its release or in the next step. In the deterministic case, the optimal competitive ratio for t...